________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:30:21
Input Data from:  dataset128.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,166
Average f[i]   :4050
Average g[i,j] :2025
Total demand   :16980
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	3220	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0    >new incumb.: 3220


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	4520	1	-1	3	10000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0    >new incumb.: 4520


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 18
> Selected Move:	6170	1	-1	4	15000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0    >new incumb.: 6170


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 20
> Selected Move:	8210	1	-1	8	19500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0    >new incumb.: 8210


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 22
> Selected Move:	8700	3	2	7	19000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0    >new incumb.: 8700


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 31
> Selected Move:	8410	3	0	5	20500


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 27
> Selected Move:	8540	3	7	9	20000


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 30
> Selected Move:	8350	3	5	0	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 31
> Selected Move:	8210	3	9	6	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 28
> Selected Move:	8020	3	3	9	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 29
> Selected Move:	7850	3	4	3	20000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 28
> Selected Move:	7782	3	8	4	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 30
> Selected Move:	7500	3	6	7	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 32
> Selected Move:	7685	1	-1	8	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 33
> Selected Move:	7500	2	3	-1	18000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 26
> Selected Move:	7713	3	9	6	20500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 28
> Selected Move:	7720	3	7	2	21000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,455

## ITERATION 17 #######################


> Neighbours evaluated; 27
> Selected Move:	7715	3	4	3	21000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 18 #######################


> Neighbours evaluated; 24
> Selected Move:	7590	3	6	7	19000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 19 #######################


> Neighbours evaluated; 28
> Selected Move:	7702	3	1	4	21200


> New Y[]: 
	
	 2  0  1  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 20 #######################


> Neighbours evaluated; 31
> Selected Move:	7837	4	4	2	20900


> New Y[]: 
	
	 2  0  3  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 21 #######################


> Neighbours evaluated; 29
> Selected Move:	7830	3	2	5	20800


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,48

## ITERATION 22 #######################


> Neighbours evaluated; 29
> Selected Move:	7886	3	7	9	20300


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 23 #######################


> Neighbours evaluated; 30
> Selected Move:	7590	3	9	2	21300


> New Y[]: 
	
	 2  0  1  1  1  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 24 #######################


> Neighbours evaluated; 30
> Selected Move:	7910	3	5	6	22000


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 25 #######################


> Neighbours evaluated; 29
> Selected Move:	7454	4	6	2	22900


> New Y[]: 
	
	 2  0  3  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 26 #######################


> Neighbours evaluated; 27
> Selected Move:	7510	3	6	9	20400


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 27 #######################


> Neighbours evaluated; 31
> Selected Move:	7510	2	9	-1	16400


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 28 #######################


> Neighbours evaluated; 28
> Selected Move:	7510	4	2	3	16700


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 29 #######################


> Neighbours evaluated; 30
> Selected Move:	7642	1	-1	7	21200


> New Y[]: 
	
	 2  0  1  3  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,52

## ITERATION 30 #######################


> Neighbours evaluated; 29
> Selected Move:	7590	3	3	1	19000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,525

## ITERATION 31 #######################


> Neighbours evaluated; 24
> Selected Move:	7842	3	0	3	20700


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,53

## ITERATION 32 #######################


> Neighbours evaluated; 26
> Selected Move:	7759	3	2	5	21700


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,535

## ITERATION 33 #######################


> Neighbours evaluated; 24
> Selected Move:	7898	3	7	9	21200


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,54

## ITERATION 34 #######################


> Neighbours evaluated; 24
> Selected Move:	7730	4	3	8	21500


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,545

## ITERATION 35 #######################


> Neighbours evaluated; 25
> Selected Move:	7668	4	8	4	21600


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,55

## ITERATION 36 #######################


> Neighbours evaluated; 29
> Selected Move:	7505	3	9	7	22100


> New Y[]: 
	
	 0  3  0  1  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 37 #######################


> Neighbours evaluated; 21
> Selected Move:	7600	3	5	2	21100


> New Y[]: 
	
	 0  3  1  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,56

## ITERATION 38 #######################


> Neighbours evaluated; 22
> Selected Move:	7650	4	4	8	21000


> New Y[]: 
	
	 0  3  1  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,565

## ITERATION 39 #######################


> Neighbours evaluated; 22
> Selected Move:	7590	3	8	0	19500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,57

## ITERATION 40 #######################


> Neighbours evaluated; 30
> Selected Move:	7315	3	7	6	21500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,575

## ITERATION 41 #######################


> Neighbours evaluated; 27
> Selected Move:	7115	3	0	8	23000


> New Y[]: 
	
	 0  3  1  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,58

## ITERATION 42 #######################


> Neighbours evaluated; 15
> Selected Move:	7912	4	8	6	21600


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,585

## ITERATION 43 #######################


> Neighbours evaluated; 24
> Selected Move:	7815	3	6	5	21000


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,59

## ITERATION 44 #######################


> Neighbours evaluated; 25
> Selected Move:	7485	3	3	7	20500


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,595

## ITERATION 45 #######################


> Neighbours evaluated; 21
> Selected Move:	7690	3	2	9	19500


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,6

## ITERATION 46 #######################


> Neighbours evaluated; 25
> Selected Move:	7480	3	8	3	20000


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,605

## ITERATION 47 #######################


> Neighbours evaluated; 30
> Selected Move:	7220	3	4	8	19500


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,61

## ITERATION 48 #######################


> Neighbours evaluated; 24
> Selected Move:	7475	3	9	2	20500


> New Y[]: 
	
	 0  3  1  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,615

## ITERATION 49 #######################


> Neighbours evaluated; 25
> Selected Move:	7165	3	8	4	21000


> New Y[]: 
	
	 0  3  1  1  1  2  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,62

## ITERATION 50 #######################


> Neighbours evaluated; 27
> Selected Move:	6630	3	3	9	20000


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,625

## ITERATION 51 #######################


> Neighbours evaluated; 29
> Selected Move:	6650	3	7	8	20000


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,63

## ITERATION 52 #######################


> Neighbours evaluated; 22
> Selected Move:	7414	3	5	3	20200


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,635

## ITERATION 53 #######################


> Neighbours evaluated; 30
> Selected Move:	7250	2	9	-1	16200


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,63

## ITERATION 54 #######################


> Neighbours evaluated; 29
> Selected Move:	7250	4	3	2	16700


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,625

## ITERATION 55 #######################


> Neighbours evaluated; 31
> Selected Move:	7460	1	-1	7	21200


> New Y[]: 
	
	 0  3  2  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,62

## ITERATION 56 #######################


> Neighbours evaluated; 22
> Selected Move:	7218	4	2	7	21600


> New Y[]: 
	
	 0  3  1  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,625

## ITERATION 57 #######################


> Neighbours evaluated; 22
> Selected Move:	7035	3	2	5	22600


> New Y[]: 
	
	 0  3  0  1  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,63

## ITERATION 58 #######################


> Neighbours evaluated; 20
> Selected Move:	7400	4	7	8	22000


> New Y[]: 
	
	 0  3  0  1  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,635

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	7220	3	5	9	20000


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,64

## ITERATION 60 #######################


> Neighbours evaluated; 27
> Selected Move:	7220	4	8	3	19700


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,645

## ITERATION 61 #######################


> Neighbours evaluated; 26
> Selected Move:	7155	4	3	4	20100


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,65

## ITERATION 62 #######################


> Neighbours evaluated; 25
> Selected Move:	7220	3	4	0	18000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,655

## ITERATION 63 #######################


> Neighbours evaluated; 29
> Selected Move:	7180	3	1	5	19800


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,66

## ITERATION 64 #######################


> Neighbours evaluated; 21
> Selected Move:	7180	3	3	4	19800


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,665

## ITERATION 65 #######################


> Neighbours evaluated; 25
> Selected Move:	7087	3	5	3	20200


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,67

## ITERATION 66 #######################


> Neighbours evaluated; 29
> Selected Move:	7241	3	7	2	20700


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,675

## ITERATION 67 #######################


> Neighbours evaluated; 28
> Selected Move:	7237	4	3	4	20700


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,68

## ITERATION 68 #######################


> Neighbours evaluated; 30
> Selected Move:	7510	2	9	-1	16700


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,675

## ITERATION 69 #######################


> Neighbours evaluated; 27
> Selected Move:	7510	4	4	8	17300


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,67

## ITERATION 70 #######################


> Neighbours evaluated; 28
> Selected Move:	7220	3	3	6	18800


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,665

## ITERATION 71 #######################


> Neighbours evaluated; 26
> Selected Move:	7220	4	8	2	17900


> New Y[]: 
	
	 2  0  3  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,66

## ITERATION 72 #######################


> Neighbours evaluated; 25
> Selected Move:	7220	4	2	4	18200


> New Y[]: 
	
	 2  0  1  0  3  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,655

## ITERATION 73 #######################


> Neighbours evaluated; 25
> Selected Move:	7220	4	4	6	17000


> New Y[]: 
	
	 2  0  1  0  1  0  3  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,65

## ITERATION 74 #######################


> Neighbours evaluated; 23
> Selected Move:	6850	3	8	3	17500


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,645

## ITERATION 75 #######################


> Neighbours evaluated; 28
> Selected Move:	6850	4	6	2	18400


> New Y[]: 
	
	 2  0  3  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,64

## ITERATION 76 #######################


> Neighbours evaluated; 28
> Selected Move:	6850	4	2	3	18700


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,635

## ITERATION 77 #######################


> Neighbours evaluated; 27
> Selected Move:	6858	1	-1	8	23200


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,63

## ITERATION 78 #######################


> Neighbours evaluated; 22
> Selected Move:	6874	4	3	4	23200


> New Y[]: 
	
	 2  0  1  1  3  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,625

## ITERATION 79 #######################


> Neighbours evaluated; 22
> Selected Move:	6850	2	8	-1	18700


> New Y[]: 
	
	 2  0  1  1  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,62

## ITERATION 80 #######################


> Neighbours evaluated; 25
> Selected Move:	6646	3	0	5	20200


> New Y[]: 
	
	 0  0  1  1  3  2  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,615

## ITERATION 81 #######################


> Neighbours evaluated; 28
> Selected Move:	7060	3	6	8	18200


> New Y[]: 
	
	 0  0  1  1  3  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 82 #######################


> Neighbours evaluated; 27
> Selected Move:	7060	4	4	2	17900


> New Y[]: 
	
	 0  0  3  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 83 #######################


> Neighbours evaluated; 27
> Selected Move:	7060	4	2	3	18200


> New Y[]: 
	
	 0  0  1  3  1  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 84 #######################


> Neighbours evaluated; 26
> Selected Move:	7060	4	3	5	18000


> New Y[]: 
	
	 0  0  1  2  1  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 85 #######################


> Neighbours evaluated; 26
> Selected Move:	7060	4	3	2	18500


> New Y[]: 
	
	 0  0  2  1  1  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 86 #######################


> Neighbours evaluated; 25
> Selected Move:	7060	4	2	4	18400


> New Y[]: 
	
	 0  0  1  1  2  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 87 #######################


> Neighbours evaluated; 25
> Selected Move:	7250	3	5	1	16600


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,58

## ITERATION 88 #######################


> Neighbours evaluated; 27
> Selected Move:	7250	4	4	8	16500


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,575

## ITERATION 89 #######################


> Neighbours evaluated; 26
> Selected Move:	7252	1	-1	9	20500


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,57

## ITERATION 90 #######################


> Neighbours evaluated; 27
> Selected Move:	7198	4	8	4	20600


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,565

## ITERATION 91 #######################


> Neighbours evaluated; 27
> Selected Move:	7144	4	4	2	20700


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 92 #######################


> Neighbours evaluated; 22
> Selected Move:	7514	3	2	6	20600


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 93 #######################


> Neighbours evaluated; 30
> Selected Move:	7367	3	9	5	22600


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 94 #######################


> Neighbours evaluated; 24
> Selected Move:	7410	4	6	5	22500


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,565

## ITERATION 95 #######################


> Neighbours evaluated; 27
> Selected Move:	7362	3	3	9	21500


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,57

## ITERATION 96 #######################


> Neighbours evaluated; 21
> Selected Move:	7298	4	5	6	21600


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,575

## ITERATION 97 #######################


> Neighbours evaluated; 25
> Selected Move:	6930	3	4	3	21600


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,58

## ITERATION 98 #######################


> Neighbours evaluated; 27
> Selected Move:	6980	4	6	5	21500


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,585

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	6940	3	8	4	22000


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,59

## ITERATION 100 #######################


> Neighbours evaluated; 26
> Selected Move:	6871	4	5	6	22100


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,595

## ITERATION 101 #######################


> Neighbours evaluated; 28
> Selected Move:	6770	2	9	-1	18100


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,6

## ITERATION 102 #######################


> Neighbours evaluated; 30
> Selected Move:	6850	3	5	2	17100


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,605

## ITERATION 103 #######################


> Neighbours evaluated; 28
> Selected Move:	7210	3	3	8	16600


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,61

## ITERATION 104 #######################


> Neighbours evaluated; 23
> Selected Move:	7210	4	6	2	18200


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,615

## ITERATION 105 #######################


> Neighbours evaluated; 24
> Selected Move:	7210	4	2	4	18100


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,62

## ITERATION 106 #######################


> Neighbours evaluated; 23
> Selected Move:	7210	4	4	8	18000


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,615

## ITERATION 107 #######################


> Neighbours evaluated; 24
> Selected Move:	6850	3	8	3	18200


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,61

## ITERATION 108 #######################


> Neighbours evaluated; 28
> Selected Move:	7193	1	-1	8	22700


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,605

## ITERATION 109 #######################


> Neighbours evaluated; 21
> Selected Move:	7069	3	6	5	22200


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,6

## ITERATION 110 #######################


> Neighbours evaluated; 20
> Selected Move:	7060	4	1	2	19100


> New Y[]: 
	
	 0  0  3  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 111 #######################


> Neighbours evaluated; 27
> Selected Move:	7060	4	2	3	19900


> New Y[]: 
	
	 0  0  2  3  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 112 #######################


> Neighbours evaluated; 22
> Selected Move:	7060	4	2	4	19800


> New Y[]: 
	
	 0  0  1  3  2  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 113 #######################


> Neighbours evaluated; 23
> Selected Move:	7060	4	3	2	19500


> New Y[]: 
	
	 0  0  3  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 114 #######################


> Neighbours evaluated; 24
> Selected Move:	7060	4	2	4	19900


> New Y[]: 
	
	 0  0  2  1  3  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 115 #######################


> Neighbours evaluated; 22
> Selected Move:	7060	4	2	3	19400


> New Y[]: 
	
	 0  0  1  2  3  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 116 #######################


> Neighbours evaluated; 22
> Selected Move:	7060	4	3	8	19700


> New Y[]: 
	
	 0  0  1  1  3  1  0  0  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 117 #######################


> Neighbours evaluated; 25
> Selected Move:	7060	4	4	2	19400


> New Y[]: 
	
	 0  0  3  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 118 #######################


> Neighbours evaluated; 25
> Selected Move:	7060	4	2	3	19700


> New Y[]: 
	
	 0  0  1  3  1  1  0  0  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 119 #######################


> Neighbours evaluated; 23
> Selected Move:	7060	4	3	5	18300


> New Y[]: 
	
	 0  0  1  1  1  3  0  0  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 120 #######################


> Neighbours evaluated; 22
> Selected Move:	7060	4	5	8	18800


> New Y[]: 
	
	 0  0  1  1  1  2  0  0  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 121 #######################


> Neighbours evaluated; 23
> Selected Move:	7060	4	5	3	20000


> New Y[]: 
	
	 0  0  1  2  1  1  0  0  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 122 #######################


> Neighbours evaluated; 23
> Selected Move:	6844	4	3	4	20400


> New Y[]: 
	
	 0  0  1  1  2  1  0  0  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 123 #######################


> Neighbours evaluated; 20
> Selected Move:	6792	4	4	2	20500


> New Y[]: 
	
	 0  0  2  1  1  1  0  0  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 124 #######################


> Neighbours evaluated; 21
> Selected Move:	6680	3	3	7	20000


> New Y[]: 
	
	 0  0  2  0  1  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,525

## ITERATION 125 #######################


> Neighbours evaluated; 27
> Selected Move:	6680	4	2	4	19900


> New Y[]: 
	
	 0  0  1  0  2  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,52

## ITERATION 126 #######################


> Neighbours evaluated; 26
> Selected Move:	6680	4	4	5	18300


> New Y[]: 
	
	 0  0  1  0  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,515

## ITERATION 127 #######################


> Neighbours evaluated; 26
> Selected Move:	6680	4	5	8	17800


> New Y[]: 
	
	 0  0  1  0  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,51

## ITERATION 128 #######################


> Neighbours evaluated; 26
> Selected Move:	6832	1	-1	3	22800


> New Y[]: 
	
	 0  0  1  1  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,505

## ITERATION 129 #######################


> Neighbours evaluated; 27
> Selected Move:	6998	4	8	3	22500


> New Y[]: 
	
	 0  0  1  2  1  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,5

## ITERATION 130 #######################


> Neighbours evaluated; 27
> Selected Move:	7200	3	3	0	20800


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,505

## ITERATION 131 #######################


> Neighbours evaluated; 22
> Selected Move:	7196	3	4	3	20800


> New Y[]: 
	
	 2  0  1  1  0  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	6937	3	8	4	21300


> New Y[]: 
	
	 2  0  1  1  1  3  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	7333	3	5	8	21800


> New Y[]: 
	
	 2  0  1  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,52

## ITERATION 134 #######################


> Neighbours evaluated; 25
> Selected Move:	7376	4	8	7	21700


> New Y[]: 
	
	 2  0  1  1  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,525

## ITERATION 135 #######################


> Neighbours evaluated; 27
> Selected Move:	7028	3	7	9	21300


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,53

## ITERATION 136 #######################


> Neighbours evaluated; 27
> Selected Move:	7021	4	9	8	21300


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,535

## ITERATION 137 #######################


> Neighbours evaluated; 29
> Selected Move:	6857	3	9	6	23800


> New Y[]: 
	
	 2  0  1  1  1  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,54

## ITERATION 138 #######################


> Neighbours evaluated; 21
> Selected Move:	6510	4	0	6	19400


> New Y[]: 
	
	 0  0  1  1  1  0  2  0  3  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,545

## ITERATION 139 #######################


> Neighbours evaluated; 26
> Selected Move:	6770	3	8	5	18900


> New Y[]: 
	
	 0  0  1  1  1  3  2  0  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,55

## ITERATION 140 #######################


> Neighbours evaluated; 26
> Selected Move:	6940	1	-1	8	23400


> New Y[]: 
	
	 0  0  1  1  1  3  2  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 141 #######################


> Neighbours evaluated; 28
> Selected Move:	6867	4	5	6	23500


> New Y[]: 
	
	 0  0  1  1  1  2  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 142 #######################


> Neighbours evaluated; 27
> Selected Move:	6800	2	3	-1	18500


> New Y[]: 
	
	 0  0  1  0  1  2  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,565

## ITERATION 143 #######################


> Neighbours evaluated; 26
> Selected Move:	6800	4	5	6	18400


> New Y[]: 
	
	 0  0  1  0  1  3  2  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,57

## ITERATION 144 #######################


> Neighbours evaluated; 23
> Selected Move:	6800	4	5	2	19500


> New Y[]: 
	
	 0  0  3  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,575

## ITERATION 145 #######################


> Neighbours evaluated; 27
> Selected Move:	6800	4	2	4	19800


> New Y[]: 
	
	 0  0  1  0  3  1  2  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,57

## ITERATION 146 #######################


> Neighbours evaluated; 25
> Selected Move:	6800	4	6	5	19700


> New Y[]: 
	
	 0  0  1  0  3  2  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,565

## ITERATION 147 #######################


> Neighbours evaluated; 23
> Selected Move:	6800	4	4	2	19400


> New Y[]: 
	
	 0  0  3  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 148 #######################


> Neighbours evaluated; 24
> Selected Move:	6800	4	2	5	20000


> New Y[]: 
	
	 0  0  2  0  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 149 #######################


> Neighbours evaluated; 23
> Selected Move:	6800	4	2	4	19900


> New Y[]: 
	
	 0  0  1  0  2  3  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,55

## ITERATION 150 #######################


> Neighbours evaluated; 22
> Selected Move:	6800	4	4	8	19800


> New Y[]: 
	
	 0  0  1  0  1  3  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,545

## ITERATION 151 #######################


> Neighbours evaluated; 23
> Selected Move:	6800	4	5	6	20000


> New Y[]: 
	
	 0  0  1  0  1  1  3  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,54

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	6746	4	8	4	20100


> New Y[]: 
	
	 0  0  1  0  2  1  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,535

## ITERATION 153 #######################


> Neighbours evaluated; 22
> Selected Move:	6693	4	4	2	20200


> New Y[]: 
	
	 0  0  2  0  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,53

## ITERATION 154 #######################


> Neighbours evaluated; 22
> Selected Move:	6680	3	6	7	19900


> New Y[]: 
	
	 0  0  2  0  1  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,525

## ITERATION 155 #######################


> Neighbours evaluated; 25
> Selected Move:	6680	4	2	4	19800


> New Y[]: 
	
	 0  0  1  0  2  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,52

## ITERATION 156 #######################


> Neighbours evaluated; 24
> Selected Move:	6680	4	4	5	18200


> New Y[]: 
	
	 0  0  1  0  1  2  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,515

## ITERATION 157 #######################


> Neighbours evaluated; 24
> Selected Move:	6680	4	5	7	18400


> New Y[]: 
	
	 0  0  1  0  1  3  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,51

## ITERATION 158 #######################


> Neighbours evaluated; 24
> Selected Move:	6680	4	5	2	19500


> New Y[]: 
	
	 0  0  3  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,505

## ITERATION 159 #######################


> Neighbours evaluated; 24
> Selected Move:	6750	3	2	1	17600


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  0 
 > pw :0,5

## ITERATION 160 #######################


> Neighbours evaluated; 28
> Selected Move:	6890	1	-1	9	21600


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 161 #######################


> Neighbours evaluated; 23
> Selected Move:	7195	4	7	8	21000


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,49

## ITERATION 162 #######################


> Neighbours evaluated; 23
> Selected Move:	7151	4	8	4	21100


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,485

## ITERATION 163 #######################


> Neighbours evaluated; 25
> Selected Move:	6880	3	4	3	20700


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 164 #######################


> Neighbours evaluated; 27
> Selected Move:	6964	3	9	2	21700


> New Y[]: 
	
	 0  3  1  2  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 165 #######################


> Neighbours evaluated; 26
> Selected Move:	6810	4	3	8	22000


> New Y[]: 
	
	 0  3  1  1  0  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	7175	3	7	4	22500


> New Y[]: 
	
	 0  3  1  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 167 #######################


> Neighbours evaluated; 19
> Selected Move:	7113	4	8	4	22600


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 168 #######################


> Neighbours evaluated; 20
> Selected Move:	7290	3	5	6	23100


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,505

## ITERATION 169 #######################


> Neighbours evaluated; 20
> Selected Move:	7224	4	4	2	23200


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,51

## ITERATION 170 #######################


> Neighbours evaluated; 22
> Selected Move:	7023	3	6	5	22700


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 171 #######################


> Neighbours evaluated; 17
> Selected Move:	7098	3	2	9	22800


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,52

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	6670	4	1	3	20000


> New Y[]: 
	
	 0  0  0  3  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,525

## ITERATION 173 #######################


> Neighbours evaluated; 25
> Selected Move:	6670	4	3	4	20000


> New Y[]: 
	
	 0  0  0  1  3  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,53

## ITERATION 174 #######################


> Neighbours evaluated; 24
> Selected Move:	6670	4	4	5	18600


> New Y[]: 
	
	 0  0  0  1  1  3  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,535

## ITERATION 175 #######################


> Neighbours evaluated; 25
> Selected Move:	6670	4	5	9	17800


> New Y[]: 
	
	 0  0  0  1  1  2  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0 
 > pw :0,54

## ITERATION 176 #######################


> Neighbours evaluated; 25
> Selected Move:	6750	3	9	1	16000


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,545

## ITERATION 177 #######################


> Neighbours evaluated; 25
> Selected Move:	6770	3	8	6	18000


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,54

## ITERATION 178 #######################


> Neighbours evaluated; 28
> Selected Move:	6850	3	5	2	18700


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,535

## ITERATION 179 #######################


> Neighbours evaluated; 26
> Selected Move:	6850	4	2	4	18600


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,53

## ITERATION 180 #######################


> Neighbours evaluated; 25
> Selected Move:	6770	3	2	5	19600


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,525

## ITERATION 181 #######################


> Neighbours evaluated; 29
> Selected Move:	6770	4	4	3	19200


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,52

## ITERATION 182 #######################


> Neighbours evaluated; 28
> Selected Move:	6886	1	-1	8	23700


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 183 #######################


> Neighbours evaluated; 22
> Selected Move:	6974	3	5	9	21700


> New Y[]: 
	
	 0  3  0  2  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 184 #######################


> Neighbours evaluated; 26
> Selected Move:	6830	4	3	8	22000


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 185 #######################


> Neighbours evaluated; 26
> Selected Move:	6790	4	8	4	22100


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 186 #######################


> Neighbours evaluated; 25
> Selected Move:	6760	3	9	5	24100


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 187 #######################


> Neighbours evaluated; 20
> Selected Move:	6790	4	4	8	24000


> New Y[]: 
	
	 0  3  0  1  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 188 #######################


> Neighbours evaluated; 22
> Selected Move:	6750	2	3	-1	19000


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  0 
 > pw :0,515

## ITERATION 189 #######################


> Neighbours evaluated; 26
> Selected Move:	6750	4	8	4	19100


> New Y[]: 
	
	 0  3  0  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  0 
 > pw :0,52

## ITERATION 190 #######################


> Neighbours evaluated; 25
> Selected Move:	6750	4	4	5	17500


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  0 
 > pw :0,525

## ITERATION 191 #######################


> Neighbours evaluated; 22
> Selected Move:	7048	1	-1	2	22500


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,53

## ITERATION 192 #######################


> Neighbours evaluated; 18
> Selected Move:	7035	3	4	3	22500


> New Y[]: 
	
	 0  3  1  1  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,535

## ITERATION 193 #######################


> Neighbours evaluated; 20
> Selected Move:	6969	4	5	6	22600


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,54

## ITERATION 194 #######################


> Neighbours evaluated; 24
> Selected Move:	6956	3	3	4	22600


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,545

## ITERATION 195 #######################


> Neighbours evaluated; 18
> Selected Move:	6883	3	5	9	20600


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,55

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	6865	3	9	7	21100


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,555

## ITERATION 197 #######################


> Neighbours evaluated; 27
> Selected Move:	6654	3	2	5	22100


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 198 #######################


> Neighbours evaluated; 28
> Selected Move:	6830	3	6	0	20000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  0 
 > pw :0,565

## ITERATION 199 #######################


> Neighbours evaluated; 17
> Selected Move:	6967	3	1	3	22200


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,57

## ITERATION 200 #######################


> Neighbours evaluated; 24
> Selected Move:	7061	3	7	9	21700


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,575

## ITERATION 201 #######################


> Neighbours evaluated; 23
> Selected Move:	7052	4	3	4	21700


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,58

## ITERATION 202 #######################


> Neighbours evaluated; 25
> Selected Move:	7104	3	5	7	20200


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,585

## ITERATION 203 #######################


> Neighbours evaluated; 28
> Selected Move:	6923	3	9	5	22200


> New Y[]: 
	
	 2  0  0  1  3  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,59

## ITERATION 204 #######################


> Neighbours evaluated; 25
> Selected Move:	6830	3	4	1	20000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0 
 > pw :0,595
________________________________________________________________

Best solution found: 8700
Run Termination time: 31.01.2010 10:31:29
Run duration: 00:01:08.3281250
________________________________________________________________
